Programming Research Group an Implementation of Higher-order Rewriting (extended Abstract)
نویسنده
چکیده
منابع مشابه
Modular Implementation of Programming Languages and a Partial Order Approach to Infinitary Rewriting
This dissertation is a collection of nine research papers pertaining to two independent areas of research. In the first part, entitled Modular Implementation of Programming Languages, we develop techniques for implementing programming languages in a modular fashion. Within this problem domain, we focus on operations on typed abstract syntax trees with the goal of developing a framework that fac...
متن کاملA Logic Programming Approach to Implementing Higher-Order Term Rewriting
Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustrate that rewrite systems and strategies for higher-order term rewriting, which includes the usual notion of rst-order rewriting, can be naturally speciied and implemented in a higher-order logic programming language. We adopt a notion of higher-order rewrite system which uses the simply typed-cal...
متن کاملMulti-paradigm Logic Programming Integrating Paradigms via Interaction Nets (extended Abstract)
In this paper we begin a study of the integration of programming paradigms using Lafont's interaction nets as a unifying framework. Interaction nets are a very simple kind of rewrite system based on rewriting of networks. Because of their linear logic foundation they give a reened view of computation; they have been used for the implementation of programming languages based on the-calculus, and...
متن کاملA de Bruijn notation for higher - order rewriting ( Extended
We propose a formalism for higher-order rewriting in de Bruijn notation. This notation not only is used for terms (as usually done in the literature) but also for metaterms, which are the syntactical objects used to express general higher-order rewrite systems. We give formal translations from higher-order rewriting with names to higher-order rewriting with de Bruijn indices, and vice-versa. Th...
متن کاملKRAM—Extended Report
Term rewriting proved to be a simple, uniform and powerful computational paradigm. Rewrite rules independently match and apply anywhere, unconstrained by the context. Rewriting is particularly appealing for defining truly concurrent systems, since rewrite rules can apply in parallel. Unfortunately, there is an inherent impediment in using term rewriting for defining concurrent systems or progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993